Arithmetic circuit complexity - PDFSEARCH.IO - Document Search Engine

Arithmetic circuit complexity
Results: 18

#	Item
11	Privacy-Preserving Set Operations Lea Kissner Dawn Song Add to Reading List Source URL: www.cs.cmu.edu Language: English - Date: 2006-11-19 16:59:50 Polynomials Commutative algebra Multiset Invariant theory IP Computer algebra Factorization of polynomials over a finite field and irreducibility tests Arithmetic circuit complexity Abstract algebra Mathematics Algebra
12	Circuits with Arbitrary Gates for Random Operators ∗ S. Jukna G. Schnitger Add to Reading List Source URL: lovelace.thi.informatik.uni-frankfurt.de Language: English - Date: 2010-04-30 12:55:41 Circuit complexity Computational complexity theory AC Boolean circuit Circuit NC Matrix FO Arithmetic circuit complexity Theoretical computer science Applied mathematics Complexity classes
13	R Foundations and Trends in Theoretical Computer Science Vol. 9, No–123 c 2013 S. Jukna and I. Sergeev Add to Reading List Source URL: lovelace.thi.informatik.uni-frankfurt.de Language: English - Date: 2014-01-24 16:28:13 Circuit complexity Linear algebra Computational complexity theory Arithmetic circuit complexity Binary operations Boolean algebra Matrix Rank Exclusive or Theoretical computer science Algebra Mathematics
14	ON DEFINING INTEGERS AND PROVING ARITHMETIC CIRCUIT LOWER BOUNDS ¨rgisser Peter Bu Abstract. Let τ (n) denote the minimum number of arithmetic operations sufficient to build the integer n from the constant 1. We prove Add to Reading List Source URL: math-www.uni-paderborn.de Language: English - Date: 2007-06-22 04:55:31 Field theory Complexity classes Computational complexity theory Polynomials Integer sequences Circuit complexity NP Finite field Algebraic geometry Theoretical computer science Abstract algebra Mathematics
15	Improved Complexity Bounds for Computing with Planar Algebraic Curves Alexander Kobel1–3 Michael Sagraloff1 Add to Reading List Source URL: arxiv.org Language: English - Date: 2014-01-22 20:37:59 Polynomials Degree of a polynomial Root-finding algorithm Arithmetic circuit complexity Algebraic geometry Mathematics Abstract algebra Algebra
16	Feebly secure cryptographic primitives∗ Edward A. Hirsch Olga Melanich Sergey I. Nikolenko Add to Reading List Source URL: logic.pdmi.ras.ru Language: English - Date: 2012-01-21 00:18:10 Computational complexity theory Linear algebra Matrix theory Matrix Circuit complexity Boolean circuit Circuit Invertible matrix Arithmetic circuit complexity Algebra Theoretical computer science Mathematics
17	Weil Image Sums (and some related problems) September ,  ver. . Add to Reading List Source URL: www.untruth.org Language: English - Date: 2012-02-29 00:47:43 Dickson polynomial Algebraic geometry Factorization of polynomials over a finite field and irreducibility tests Arithmetic circuit complexity Polynomials Mathematics Algebra
18	Light Up is NP-complete Brandon McPhail February 28, 2005 Add to Reading List Source URL: people.cs.umass.edu Language: English - Date: 2007-09-02 12:14:45 Complexity classes NP-complete Boolean algebra NP PP UP P Reduction Arithmetic circuit complexity Theoretical computer science Computational complexity theory Applied mathematics